Explicit convex and concave envelopes through polyhedral subdivisions

نویسندگان

  • Mohit Tawarmalani
  • Jean-Philippe P. Richard
  • Chuanhui Xiong
چکیده

5 In this paper, we derive explicit characterizations of convex and concave envelopes of several 6 nonlinear functions over various subsets of a hyper-rectangle. These envelopes are obtained 7 by identifying polyhedral subdivisions of the hyper-rectangle over which the envelopes can be 8 constructed easily. In particular, we use these techniques to derive, in closed-form, the concave 9 envelopes of concave-extendable supermodular functions and the convex envelopes of disjunctive 10 convex functions. 11

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex underestimation for posynomial functions of positive variables

The approximation of the convex envelope of nonconvex functions is an essential part in deterministic global optimization techniques (Floudas inDeterministic Global Optimization: Theory, Methods and Application, 2000). Current convex underestimation algorithms for multilinear terms, based on arithmetic intervals or recursive arithmetic intervals (Hamed in Calculation of bounds on variables and ...

متن کامل

Some results on the strength of relaxations of multilinear functions

We study approaches for obtaining convex relaxations of global optimization problems containing multilinear functions. Specifically, we compare the concave and convex envelopes of these functions with the relaxations that are obtained with a standard relaxation approach, due to McCormick. The standard approach reformulates the problem to contain only bilinear terms and then relaxes each term in...

متن کامل

Polyhedral Convexity and the Existence of Approximate Equilibria in Discontinuous Games∗

Radzik (1991) showed that two-player games on compact intervals of the real line have ε – equilibria for all ε > 0, provided that payoff functions are upper semicontinuous and strongly quasi-concave. In an attempt to generalize this theorem, Ziad (1997) stated that the same is true for n-player games on compact, convex subsets of Rm, m ≥ 1 provided that we strengthen the upper semicontinuity co...

متن کامل

Characterizations of $L$-convex spaces

In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are introduced. It is shown that the category of $L$-concave spaces and the category of concave $L$-interior spaces are isomorphic, and they are both isomorphic to the category of concave $L$-neighborhood systems whenever $L$ is a completely distributive lattice. Also, it i...

متن کامل

A Geometric Study of the Split Decomposition

This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete concave functions, Bandelt-Dress’ split decomposition can be derived as a special case of more general decomposition of polyhedral/discrete concave functions introduced in this paper. It is shown that the combinatorics...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 138  شماره 

صفحات  -

تاریخ انتشار 2013